package com.lzhsite.leetcode.algoritom.practise.linked;

import com.lzhsite.leetcode.algoritom.dataStruct.DLNode;

public class LinkListCommon {

	public static void init(DLNode node1,DLNode node2) {
		
		if(node1==null){
			 node1= new DLNode();
		}
		if(node2==null){
			node2= new DLNode();
		}
		node1.element = 1;  
		  
		node1.next = new DLNode();  
		node1.next.element = 3;  
  
		node1.next.next = new DLNode();  
		node1.next.next.element = 6;  
  
		node1.next.next.next = new DLNode();  
		node1.next.next.next.element = 8;  
		

		node2.element = 1;  
  
		node2.next = new DLNode();  
		node2.next.element = 2;  
  
		node2.next.next = new DLNode();  
		node2.next.next.element = 3;  
  
		node2.next.next.next = new DLNode();  
		node2.next.next.next.element = 4;  
		
		node2.next.next.next.next = new DLNode();  
		node2.next.next.next.next.element = 8;  
		
		
	}
}
